Constraint 2 is not relaxed
Constraint 3 is not relaxed
Constraint 4 is not relaxed
Constraint 5 is not relaxed
Constraint 6 is relaxed
The time to read the input and initialise the problem = 1547 ms

Iteration 1
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 140 ms
The lower bound solution is:
z = 25340.124760
The time to read the lower bound solution = 0 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 95669.949488
The optimal solution has not been found yet.

Iteration 2
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 29305.637954
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 133455.813490
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 3
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 33835.569654
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 107279.479170
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 4
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 36335.778133
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 135466.519270
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 5
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 40418.948779
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 95669.949488
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 6
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 43096.337661
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 133455.813490
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 7
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 45817.762099
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 95669.949488
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 8
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 47985.460135
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 116908.752840
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 9
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 51755.397709
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 110644.296660
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 10
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 34550.057386
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 117197.385320
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 11
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 29382.198543
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 112374.745040
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 12
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 30638.401321
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 70028.802083
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 13
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 29928.450779
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 91630.949488
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 14
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 29398.151517
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 66766.022727
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 15
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 29102.228811
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 72748.344828
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 16
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 27513.354044
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 70028.802083
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 17
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 26747.105879
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 91630.949488
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 18
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 26019.253794
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64770.541958
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 19
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 25882.528733
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 64770.541958
The optimal solution has not been found yet.

Iteration 20
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 25217.616079
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 66724.011494
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 21
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 25122.803400
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 64770.541958
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 22
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 24410.938456
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 0 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 66724.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 23
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 23960.111535
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 106030.215690
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 24
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 23383.001690
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 64770.541958
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 25
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 22644.743665
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 66724.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 26
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 22182.310281
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 69987.699811
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 27
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 21435.738596
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 101557.333330
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 28
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 20576.683027
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 78541.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 29
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 20050.504351
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 69987.699811
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 30
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 19303.895906
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 78541.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 31
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 18505.200247
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 108776.196080
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 32
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 17905.151870
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 69987.699811
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 33
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 17153.413571
The time to read the lower bound solution = 16 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 78541.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 34
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 16491.236964
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 93597.082888
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 35
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 15774.579268
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 69987.699811
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 36
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 15017.562709
The time to read the lower bound solution = 15 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 78541.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 37
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = 14188.417716
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 91728.517960
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 38
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 11085.070138
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 63675.538913
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 39
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 10331.688750
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 31 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 90841.555556
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 40
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 8107.558621
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 31 ms
The upper bound solution is:
z = 69871.011494
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 41
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 7606.313608
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 66822.538913
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 42
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 6919.559913
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 15 ms
The upper bound solution is:
z = 69871.011494
The time to read the upper bound solution = 0 ms
The optimal solution has not been found yet.

Iteration 43
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 6398.209064
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 32 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 68412.939394
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 44
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 6315.632137
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 68412.939394
The optimal solution has not been found yet.

Iteration 45
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = 5833.900332
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 68412.939394
The optimal solution has not been found yet.

Iteration 46
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 5146.632926
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 16 ms
The time to compute the upper bound = 0 ms
The upper bound solution is:
z = 90841.555556
The time to read the upper bound solution = 15 ms
The optimal solution has not been found yet.

Iteration 47
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 4208.789980
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 48
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = 3242.880435
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 49
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 2276.348738
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 50
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = 1309.245470
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 51
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = 341.614927
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 52
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -626.504225
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 53
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -1598.172540
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 54
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -2581.306491
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 55
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -3564.834859
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 56
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -4548.730737
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 57
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -5532.971691
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 58
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -6517.536504
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 59
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -7502.406469
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 60
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -8487.563459
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 61
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -9472.991240
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 62
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -10458.676136
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 63
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -11444.603757
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 64
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -12430.762271
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 65
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -13417.139821
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 66
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -14403.725139
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 67
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -15390.508895
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 68
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -16377.481728
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 69
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -17364.634896
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 70
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -18351.960277
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 71
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -19339.450390
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 72
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -20327.099036
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 73
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -21314.898019
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 74
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -22302.842417
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 75
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -23290.925962
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 76
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -24279.143693
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 77
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -25267.489305
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 78
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -26255.959120
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 79
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -27244.548121
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 80
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -28233.251284
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 81
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -29222.065542
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 82
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -29716.526023
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 83
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -30211.037651
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 84
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -30705.599860
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 85
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -31200.209459
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 86
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -31694.865871
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 87
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -32189.567862
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 88
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -32684.312879
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 89
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -33179.100341
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 90
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -33673.928340
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 91
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -34168.796291
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 92
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -34663.702937
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 93
The time to create lower bound problem = 63 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -35158.647028
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 94
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -35653.626645
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 95
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -36148.642509
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 90841.555556
The optimal solution has not been found yet.

Iteration 96
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -36647.520260
The time to read the lower bound solution = 0 ms
The time to check if computing the upper bound is needed = 0 ms
The time to create the upper bound problem = 15 ms
The time to compute the upper bound = 16 ms
The upper bound solution is:
z = 101373.196080
The time to read the upper bound solution = 16 ms
The optimal solution has not been found yet.

Iteration 97
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -37149.675031
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 98
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -37651.829802
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 99
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -38153.984573
The time to read the lower bound solution = 32 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 100
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -38656.139345
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 101
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -39158.294116
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 102
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -39660.448889
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 103
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -40162.603660
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 104
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -40664.758429
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 105
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -41166.913205
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 106
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -41669.067973
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 107
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -42171.222745
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 108
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -42673.377520
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 109
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -43175.532289
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 110
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -43677.687063
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 111
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -44179.841831
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 112
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -44681.996603
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 113
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -45184.151376
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 114
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -45686.306149
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 115
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -46188.460919
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 116
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -46690.615691
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 117
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -47192.770461
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 118
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -47694.925236
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 119
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -48197.080005
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 120
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -48699.234777
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 121
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -49201.389549
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 122
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -49703.544320
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 123
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -50205.699090
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 124
The time to create lower bound problem = 141 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -50707.853865
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 125
The time to create lower bound problem = 125 ms
The time to compute the lower bound = 109 ms
The lower bound solution is:
z = -51210.008638
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 126
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -51712.163406
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 127
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -52214.318181
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 128
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -52716.472947
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 129
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -53218.627724
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 130
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -53720.782495
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 131
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -54222.937266
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 132
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -54725.092036
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 133
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -55227.246810
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 134
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -55729.401580
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 135
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -56231.556352
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 136
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -56733.711124
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 137
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -57235.865896
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 138
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -57738.020664
The time to read the lower bound solution = 94 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 139
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -58240.175436
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 140
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -58742.330208
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 141
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -59244.484983
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 142
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -59746.639754
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 143
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -60248.794525
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 144
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -60750.949296
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 145
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -61253.104069
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 146
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -61755.258839
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 147
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -62257.413614
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 148
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -62759.568384
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 149
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -63261.723152
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 150
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 328 ms
The lower bound solution is:
z = -63763.877930
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 151
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -64266.032697
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 152
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -64768.187467
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 153
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -65270.342242
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 154
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -65772.497012
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 155
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -66274.651780
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 156
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -66776.806558
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 157
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -67278.961328
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 158
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -67781.116098
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 159
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -68283.270875
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 160
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -68785.425639
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 161
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -69287.580414
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 162
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -69538.657800
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 163
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -69789.735187
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 164
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -70040.812572
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 165
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -70291.889958
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 166
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -70542.967341
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 167
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -70794.044729
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 168
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -71045.122115
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 169
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -71296.199502
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 170
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -71547.276888
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 171
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -71798.354271
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 172
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -72049.431660
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 173
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -72300.509043
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 174
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -72551.586429
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 175
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -72802.663817
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 176
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -73053.741200
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 177
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -73304.818587
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 178
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -73555.895973
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 179
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -73806.973362
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 180
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -74058.050745
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 181
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -74309.128132
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 182
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -74560.205516
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 183
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -74811.282900
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 184
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -75062.360288
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 185
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -75313.437673
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 186
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -75564.515063
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 187
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -75815.592447
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 188
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -76066.669829
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 189
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -76317.747218
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 190
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -76568.824599
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 191
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -76819.901990
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 192
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -77070.979376
The time to read the lower bound solution = 110 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 193
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -77322.056759
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 194
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -77573.134145
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 195
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -77824.211534
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 196
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -78075.288914
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 197
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -78326.366303
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 198
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -78577.443692
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 199
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -78828.521076
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 200
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -79079.598458
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 201
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -79330.675844
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 202
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -79581.753235
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 203
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -79832.830618
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 204
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -80083.908008
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 205
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -80334.985390
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 206
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -80586.062776
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 207
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -80837.140163
The time to read the lower bound solution = 344 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 208
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -81088.217547
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 209
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -81339.294932
The time to read the lower bound solution = 62 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 210
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 31 ms
The lower bound solution is:
z = -81590.372321
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 211
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 47 ms
The lower bound solution is:
z = -81841.449706
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 212
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -82092.527093
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 213
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -82343.604474
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 214
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -82594.681865
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 215
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -82845.759248
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 216
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -83096.836636
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 217
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -83347.914018
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 218
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -83598.991405
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 219
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -83850.068791
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 220
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -84101.146178
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 221
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -84352.223565
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 222
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -84603.300946
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 223
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -84854.378334
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 224
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -85105.455720
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 225
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -85356.533105
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 226
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -85607.610490
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 227
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -85858.687879
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 228
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -86109.765265
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 229
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -86360.842650
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 230
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -86611.920033
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 231
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -86862.997421
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 232
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -87114.074806
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 233
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -87365.152195
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 234
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -87616.229577
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 235
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -87867.306965
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 236
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -88118.384350
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 237
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 32 ms
The lower bound solution is:
z = -88369.461734
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 238
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -88620.539124
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 239
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -88871.616510
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 240
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -89122.693893
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 241
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -89373.771280
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 242
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -89499.309972
The time to read the lower bound solution = 46 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 243
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -89624.848666
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 244
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -89750.387357
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 245
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -89875.926050
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 246
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -90001.464744
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 247
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -90127.003435
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 248
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -90252.542127
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 249
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -90378.080825
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 250
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -90503.619513
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 251
The time to create lower bound problem = 32 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -90629.158210
The time to read the lower bound solution = 47 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 252
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -90754.696905
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 253
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -90880.235594
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 254
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -91005.774287
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 255
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -91131.312977
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 256
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -91256.851674
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 257
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -91382.390366
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 258
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -91507.929059
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 259
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 62 ms
The lower bound solution is:
z = -91633.467751
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 260
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -91759.006442
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 261
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -91884.545138
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 262
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -92010.083833
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 263
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -92135.622523
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 264
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -92261.161218
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 265
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -92386.699909
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 266
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -92512.238599
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 267
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -92637.777296
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 268
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -92763.315989
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 269
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -92888.854681
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 270
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -93014.393374
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 271
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -93139.932068
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 272
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -93265.470761
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 273
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -93391.009451
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 274
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -93516.548143
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 275
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -93642.086836
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 276
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -93767.625532
The time to read the lower bound solution = 15 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 277
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -93893.164225
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 278
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -94018.702914
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 279
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -94144.241609
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 280
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -94269.780303
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 281
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -94395.318995
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 282
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -94520.857690
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 283
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -94646.396383
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 284
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -94771.935071
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 285
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -94897.473767
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 286
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -95023.012460
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 287
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -95148.551152
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 288
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -95274.089848
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 289
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -95399.628540
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 290
The time to create lower bound problem = 0 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -95525.167234
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 291
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -95650.705923
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 292
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -95776.244616
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 293
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -95901.783310
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 294
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -96027.322002
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 295
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -96152.860695
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 296
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -96278.399390
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 297
The time to create lower bound problem = 31 ms
The time to compute the lower bound = 0 ms
The lower bound solution is:
z = -96403.938081
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 298
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -96529.476775
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 299
The time to create lower bound problem = 16 ms
The time to compute the lower bound = 15 ms
The lower bound solution is:
z = -96655.015470
The time to read the lower bound solution = 16 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.

Iteration 300
The time to create lower bound problem = 15 ms
The time to compute the lower bound = 16 ms
The lower bound solution is:
z = -96780.554159
The time to read the lower bound solution = 0 ms
This set of open plants and depots has been found before.
The time for checking, creating and reading the upper bound problem = 0 ms
The upper bound solution is:
z = 101373.196080
The optimal solution has not been found yet.
The iteration limit has been reached

TIMINGS:

Total run time for the heuristic = 359297 ms
The total time to calculate the lower bounds with CPLEX = 4191 ms
The total time to calculate the upper bounds with CPLEX = 485 ms
The total time to create the lower bound problems = 5234 ms
The total time to read the lower bound solutions = 2220 ms
The total time to check if computing the upper bounds are needed = 0 ms
The total time to create the upper bound problems = 669 ms
The total time to read the upper bound solutions = 185 ms 

The best upper bound found = 63675.538913, the best lower bound found = 51755.397709
Therefore the duality gap is 23.031687%
